minimum weight routing

См. также в других словарях:

• List of ad-hoc routing protocols — An Ad hoc routing protocol is a convention or standard that controls how nodes come to agree which way to route packets between computing devices in a mobile ad hoc network (MANET).In ad hoc networks , nodes do not have a priori knowledge of… …   Wikipedia

• Abkürzungen/Luftfahrt/L–R — Dies ist der vierte Teil der Liste Abkürzungen/Luftfahrt. Liste der Abkürzungen Teil 1 A A Teil 2 B–D B; C; D Teil 3 E–K …   Deutsch Wikipedia

• Travelling salesman problem — The travelling salesman problem (TSP) is an NP hard problem in combinatorial optimization studied in operations research and theoretical computer science. Given a list of cities and their pairwise distances, the task is to find a shortest… …   Wikipedia

• List of NP-complete problems — Here are some of the more commonly known problems that are NP complete when expressed as decision problems. This list is in no way comprehensive (there are more than 3000 known NP complete problems). Most of the problems in this list are taken… …   Wikipedia

• Bellman-Ford algorithm — The Bellman–Ford algorithm, a label correcting algorithm [cite web |url=http://www.mit.edu/people/dimitrib/SLF.pdf |title=A Simple and Fast Label Correcting Algorithm for Shortest Paths |accessdate=2008 10 01 |author=Dimitri P. Bertsekas… …   Wikipedia

• Steiner tree problem — Steiner tree for three points A, B, and C (note there are no direct connections between A, B, C). The Steiner point S is located at the Fermat point of the triangle ABC …   Wikipedia

• Flight planning — A Tarom Boeing 737 300 and United Airlines Boeing 777 200 taxiing to depart London Heathrow Airport. Flight planning is the process of producing a flight plan to describe a proposed aircraft flight. It involves two …   Wikipedia

• railroad — /rayl rohd /, n. 1. a permanent road laid with rails, commonly in one or more pairs of continuous lines forming a track or tracks, on which locomotives and cars are run for the transportation of passengers, freight, and mail. 2. an entire system… …   Universalium

• baseball — /bays bawl /, n. 1. a game of ball between two nine player teams played usually for nine innings on a field that has as a focal point a diamond shaped infield with a home plate and three other bases, 90 ft. (27 m) apart, forming a circuit that… …   Universalium

• Border Gateway Protocol — Pour les articles homonymes, voir BGP. Pile de protocoles 7.  Application 6.  …   Wikipédia en Français

• Dijkstra's algorithm — Not to be confused with Dykstra s projection algorithm. Dijkstra s algorithm Dijkstra s algorithm runtime Class Search algorithm Data structure Graph Worst case performance …   Wikipedia